On k-critical, n-connected graphs
نویسندگان
چکیده
منابع مشابه
On connected (γ, k)-critical graphs
A graph G is said to be (γ, k)-critical if γ(G−S) < γ(G) for any set S of k vertices and domination number γ. Properties of (γ, k)-critical graphs are studied for k ≥ 3. Ways of constructing a (γ, k)-critical graph from smaller (γ, k)-critical graphs are presented.
متن کاملSpanning k-Trees of n-Connected Graphs
A tree is called a k-tree if the maximum degree is at most k. We prove the following theorem, by which a closure concept for spanning k-trees of n-connected graphs can be defined. Let k ≥ 2 and n ≥ 1 be integers, and let u and v be a pair of nonadjacent vertices of an n-connected graph G such that degG(u)+degG(v) ≥ |G|−1−(k−2)n, where |G| denotes the order of G. Then G has a spanning k-tree if ...
متن کاملOn k-chromatically connected graphs
A graph G is chromatically k–connected if every vertex cutset induces a subgraph with chromatic number at least k. Thus, in particular each neighborhood has to induce a k–chromatic subgraph. In [3], Godsil, Nowakowski and Nešetřil asked whether there exists a k–chromatically connected graph such that every minimal cutset induces a subgraph with no triangles. We show that the answer is positive ...
متن کاملON GENERALIZED k-DIAMETER OF k-REGULAR k-CONNECTED GRAPHS
In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph on n vertices has the generalized k-diameter at most n/2 and this upper bound cannot be improved when n = 4k − 6 + i(2k − 4).
متن کاملOn critically k-edge-connected graphs
Let G be a simple graph on n vertices having edge-connectivity /(.' (G) > a and minimum degree o(G) We say G is k-critical if /(.' (G) = k and /(.' (G e) < k for every edge e of G. In this paper we prove that a k-critical graph has 1<' (G) o(G). We descri be a number of classes of k-cri tical graphs and consider the problem of determining the edge-maximal ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90065-6